Petrie Duality and the Anstee-Robertson Graph
نویسندگان
چکیده
We define the operation of Petrie duality for maps, describing its general properties both geometrically and algebraically. We give a number of examples and applications, including the construction of a pair of regular maps, one orientable of genus 17, the other non-orientable of genus 52, which embed the 40-vertex cage of valency 6 and girth 5 discovered independently by Robertson and Anstee. We prove that this map (discovered by Evans) and its Petrie dual are the only regular embeddings of this graph, together with a similar result for a graph of order 40, valency 6 and girth 3 with the same automorphism group.
منابع مشابه
Twisted Duality for Embedded Graphs
We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge, and taking the partial dual with respect to the edge. These two operations give rise to an action of S3 |E(G)|, the ribbon group, on G. The action of the ribbon group on embedded graphs extends the concepts of duality, partial duality, and Petrie duality. We show that th...
متن کاملSelf-Dual, Self-Petrie Covers of Regular Polyhedra
The well-known duality and Petrie duality operations on maps have natural analogs for abstract polyhedra. Regular polyhedra that are invariant under both operations have a high degree of both “external” and “internal” symmetry. The mixing operation provides a natural way to build the minimal common cover of two polyhedra, and by mixing a regular polyhedron with its five other images under the d...
متن کاملNear Pole Polar Diagram of Points and its Duality with Applications
In this paper we propose a new approach to plane partitioning with similar features to those of Polar Diagram, but we assume that the pole is close to the sites. The result is a new tessellation of the plane in regions called Near Pole Polar Diagram NPPD. Here we define the (NPPD) of points, the dual and the Contracted dual of it, present an optimal algorithms to draw them and discuss the appli...
متن کاملDuality Theorems for Blocks and Tangles in Graphs
We prove a duality theorem applicable to a a wide range of specialisations, as well as to some generalisations, of tangles in graphs. It generalises the classical tangle duality theorem of Robertson and Seymour, which says that every graph either has a large-order tangle or a certain low-width tree-decomposition witnessing that it cannot have such a tangle. Our result also yields duality theore...
متن کاملNote on Petrie and Hamiltonian cycles in cubic polyhedral graphs
In this note we show that deciding the existence of a Hamiltonian cycle in a cubic plane graph is equivalent to the problem of the existence of an associated cubic plane multi-3-gonal graph with a Hamiltonian cycle which takes alternately left and right edges at each successive vertex, i.e. it is also a Petrie cycle. The Petrie Hamiltonian cycle in an n-vertex plane cubic graph can be recognize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Symmetry
دوره 7 شماره
صفحات -
تاریخ انتشار 2015